Finite-dimensional Discrete Random Structures and Bayesian Clustering

نویسندگان

چکیده

Discrete random probability measures stand out as effective tools for Bayesian clustering. The investigation in the area has been very lively, with a strong emphasis on nonparametric procedures based either Dirichlet process or more flexible generalizations, such normalized independent increments (NRMI). literature finite-dimensional discrete priors is much limited and mostly confined to standard Dirichlet-multinomial model. While specification may be attractive due conjugacy, it suffers from considerable limitations when comes addressing clustering problems. In order overcome these, we introduce novel class of that arise hierarchical compositions structures. Despite analytical hurdles construction entails, are able characterize induced partition determine explicit expressions associated urn scheme posterior distribution. A detailed comparison (infinite-dimensional) NRMIs also provided: indeed, informative bounds discrepancy between laws obtained. Finally, performance our proposal over existing methods assessed real application where study publicly available dataset Italian education system comprising scores mandatory nationwide test.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topics in discrete random structures

This thesis presents four papers on problems in discrete probability. A common theme of the articles is to take some class of discrete structures, impose some randomness, and then consider what happens asymptotically as the size of the structure tends to infinity. Paper I concerns first–passage percolation on Cartesian graph powers G of some fixed base graph G as d → ∞. We propose a natural asy...

متن کامل

Random Discrete Structures: Approximations and Applications

The investigators in this discovery grant are: Aihua Xia at http://www.ms.unimelb.edu.au/Personnel/profile.php?PC_id=76 Andrew Barbour at http://user.math.uzh.ch/barbour/ Phil Pollett at http://www.maths.uq.edu.au/~pkp/ Nathan Ross at http://www.ms.unimelb.edu.au/~rossn1/ Malwina Luczak at http://www.maths.qmul.ac.uk/~luczak/ Gesine Reinert at http://www.stats.ox.ac.uk/~reinert/ Adrian Roellin ...

متن کامل

Extremal Results for Random Discrete Structures

We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemerédi’s theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we determine the threshold for Turán-type problems for random graphs and hypergraphs. In particular, we verify a conjecture of Kohayakawa, Luczak, and Rödl for Turán-type...

متن کامل

Ramsey properties of random discrete structures

We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems of equations in random subsets of the integers and we prove the 1-statement of the conjectured threshold for Ramsey’s theorem for random hypergraphs. Those results were conjectured by Rödl and Ruciński and similar result...

متن کامل

Phase transition phenomena in random discrete structures

A random discrete structure is a combinatorial object, which emerges as a result of a series of random experiments; equivalently, it can be viewed as a probability space whose elements are combinatorial structures as graphs, hypergraphs, permutations etc. In many of random discrete structures a small change of parameters of the model can greatly affect its (typical) behaviour. One of the semina...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2023

ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']

DOI: https://doi.org/10.1080/01621459.2022.2149406